package demo3;

public class Solution {
    public int size(ListNode head){
        ListNode cur = head;
        int count = 0;
        while(cur != null){
            count++;
            cur = cur.next;
        }
        return count;
    }
    public ListNode FindKthToTail(ListNode head,int k) {
        if(k < 0 || k > size(head)){
            System.out.println("超出容量了");
        }
        ListNode
    }
}
